Families of Legendre–Sheffer polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some new families of definite polynomials and the composition conjectures

The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...

متن کامل

Some Families of Graphs whose Domination Polynomials are Unimodal

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.

متن کامل

6.1 Interlacing Families of Polynomials

In this lecture we introduce the concept of interlacing for polynomials. This concept provide a convenient way of reasoning about orderings of the roots of real-rooted polynomials. Specifically, it provides a way of tying the roots of the average polynomial (obtained by averaging the coefficients) to the roots of the individual polynomials. This can for example —in the spirit of the probabilist...

متن کامل

some families of graphs whose domination polynomials are unimodal

let $g$ be a simple graph of order $n$. the domination polynomial of $g$ is the polynomial $d(g, x)=sum_{i=gamma(g)}^{n} d(g,i) x^{i}$, where $d(g,i)$ is the number of dominating sets of $g$ of size $i$ and $gamma(g)$ is the domination number of $g$. in this paper we present some families of graphs whose domination polynomials are unimodal.

متن کامل

Specializations of One-parameter Families of Polynomials

Let K be a number field, and let λ(x, t) ∈ K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of α ∈ K for which the specialized polynomial λ(x, α) is K-reducible. We apply this to show that for any fixed n ≥ 10 and for any number field K, all but finitely many K-specializations of the degree n generalized Laguerre polynomial L (t) n (x) are K-irreduci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2012

ISSN: 0895-7177

DOI: 10.1016/j.mcm.2011.09.023